Pruning the Two-Dimensional Fast Cosine Transform
نویسندگان
چکیده
Two pruning algorithms for the Vector-Radix Fast Cosine Transform are presented. Both are based on an in-place approach of the direct two-dimensional fast cosine transform (2D FCT). The first pruning algorithm concerns the computation of N0xN0 out of NxN DCT points, where both N0 and N are powers of 2. The second pruning algorithm is more general and concerns a recursive approach for the computation of any number of points of arbitrary shaped regions. A comparison with the row-column pruning method reveals that the proposed algorithms are more efficient in terms of total computational complexity, i.e. multiplications, additions and data transfers.
منابع مشابه
Fast discrete cosine transform pruning
A new fast pruning algorithm is proposed for computing the IV, lowest frequency components of a Iength-~V discrete cosine transform, where AVO is any integer less than or equal to N, and AV = 2“‘. The computational complexity of the developed algorithm is lower than any of the existing algorithms, resulting in significant time savings. In the special case that AVO = 2 “ Q , the required number ...
متن کاملType-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DSTIV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count of real multiplications and additions than previously published algorithms, without sacrificing numerical accuracy. Asymptotically, the operation count is reduced from 2N log2 N +O(N...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملA generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform
In this paper, a generalized output pruning algorithm for matrixvector multiplication is proposed first. Then the application of the proposed pruning algorithm to compute pruning Discrete Cosine Transform (DCT) is addressed. It is shown that, for a given decomposition of the matrix of the transform kernel and the pruning pattern, the unnecessary operations for computing an output pruning DCT ca...
متن کاملAn efficient architecture for the in place fast cosine transform
The two-dimensional discrete cosine transform (2D-DCT) is at the core of image encoding and compression applications. We present a new architecture for the 2D-DCT which is based on row-column decomposition. An efficient architecture to compute the one-dimensional fast direct (1D-DCT) and inverse cosine (1D-IDCT) transforms, which is based in reordering the butterflies after their computation, i...
متن کامل